A note on simplicial cliques
نویسندگان
چکیده
Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, is, clique $K$ such for vertex $v \in K$, the set of neighbours $v$ outside is clique. In fact, existence more general class graphs defined forbidden induced subgraphs.
منابع مشابه
A note on cliques and independent sets
For integers m,n ≥ 2, let f(m,n) be the minimum order of a graph where every vertex is in both a clique of cardinality m and an independent set of cardinality n. We show that f(m,n) = d( √ m− 1 + √ n− 1)2e. In this paper we use the terminology of [1]. Specifically, graph G has vertex set V (G), edge set E(G) and order p = |V (G)|. Also, N(v) denotes the neighborhood of a vertex v, i.e., the set...
متن کاملA Note on Simplicial Dimension Shifting
We discuss a simplicial dimension shift which associates to each n-manifold an n−1-manifold. As a corollary we show that an invariant which was recently proposed by Ooguri and by Crane and Yetter for the construction of 4-dimensional quantum field theories out of 3-dimensional theories is trivial. Ooguri [1] proposed recently a method for obtaining 4-manifold invariants and studying quantum gra...
متن کاملSimplicial cliques in claw-free graphs
A graph G is claw-free if no induced subgraph of it is isomorphic to the complete bipartite graph K1,3, and it is prime if |V (G)| ≥ 4 and there is no X ⊆ V (G) with 1 < |X| < |V (G)| such that every vertex of V (G) \X with a neighbour in X is adjacent to every x ∈ X. A simplicial clique in G is a non-empty clique K, such that for every k ∈ K the set of neighbours of k in V (G) \K is a clique. ...
متن کاملA note on the problem of reporting maximal cliques
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper of Bron–Kerbosh [C. Bron, J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Communication of ACM 16 (9) (1973) 575–577], and two papers recently published in TCS, namely that of Tomita et al. [To...
متن کاملA Note on Solid Coloring of Pure Simplicial Complexes
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in R may be colored with d+1 colors so that no two simplices that share a (d−1)-facet have the same color. In R this says that any planar map all of whose faces are triangles may be 3-colored, and in R it says that tetrahedra in a collection may be “solid 4-colored” so that no two g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112470